May Testing, Non-interference, and Compositionality

نویسنده

  • Steve A. Schneider
چکیده

This paper uses CSP to introduce a characterisation of non interference in terms of the deductions that may be made about high level processes by low level tests May testing yields classic noninference and has a concise formulation in CSP It is preserved by a wider range of composition oper ators than are normally considered in the context of non interference It turns out that the extensive list of compositionality theorems in our case can be used to derive the cases generally considered The CSP character isation of may non interference also permits some attractive and simple compositionality proofs

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Intra-Modular Structuring in Model-Oriented Speci cation: Expressing Non-interference with Read andWrite Frames

Compositionality provides the key to managing complexity in software systems and thus should be sought at all levels in the design process. In the development of code from model-oriented speci cations, compositionality can not only be achieved by the decomposition of system speci cations into modules but may also arise within the development of individual modules. This thesis considers the comp...

متن کامل

Compositional Non-Interference for Concurrent Programs via Separation and Framing

Reasoning about information flow in a concurrent setting is notoriously difficult due in part to timing channels that may leak sensitive information. In this paper, we present a compositional and flexible type-and-effect system that guarantees non-interference by disallowing potentially insecure races that can be exploited through internal timing attacks. In contrast to many previous approaches...

متن کامل

Formal Verification of Language-Based Concurrent Noninterference

We perform a formal analysis of compositionality techniques for proving possibilistic noninterference for a while language with parallel composition. We develop a uniform framework where we express a wide range of noninterference variants from the literature and compare them w.r.t. their contracts: the strength of the security properties they ensure weighed against the harshness of the syntacti...

متن کامل

Proving Concurrent Noninterference

We perform a formal analysis of compositionality techniques for proving possibilistic noninterference for a while language with parallel composition. We develop a uniform framework where we express a wide range of noninterference variants from the literature and compare them w.r.t. their contracts: the strength of the security properties they ensure weighed against the harshness of the syntacti...

متن کامل

C/C++ Causal Cycles Confound Compositionality

The rise of multicore processors has made concurrency ubiquitous. In response, mainstream languages have begun to offer primitives for concurrent programming. To avoid the cost of inter-core synchronisation, the new C/C++ standard, C11 [2, 3], offers weakly consistent relaxed operations, alongside traditional reads, writes and mutexes. When using relaxed operations, different threads may see di...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 40  شماره 

صفحات  -

تاریخ انتشار 2000